Model-checking of infinite Kripke structures defined by simple graph grammars

We present an algorithm for checking whether an innnite transition system, deened by a graph grammar of a restricted kind, is a model of a formula of the temporal logic CTL. We rst present the syntax and the semantics of CTL, that are deened with respect to transition systems, labelled with atomic propositions. Then, we show how to adapt the formalism of graph grammars, for expressing such innnite transition systems. Our algorithm treats such a nite representation, and modify it, ensuring that the labelling for formulas remains coherent with the truth values of the diierent states of the innnite transition system.